\section{Results for k-Core - SHOULD WE KEEP THIS?}\label{sec:kcore}

\begin{theorem}\label{thm:mainkcore}
Under a model where the adversary is allowed to delete/add edges such that the diameter is always at most $D$, there is a distributed algorithm that requires only $O(D\min\{n, m/k\})$ rounds per edge-failure to maintain the $k$-core (which is the trivial bound as it takes that many rounds to compute the $k$-core) .
\end{theorem}

\subsection{Algorithm and Proof}
